package com.study.dataStructure.leetcode.problems;

import com.study.dataStructure.util.ArraysUtil;

import java.util.HashMap;
import java.util.Map;

/**
 * @author tiny
 * @date 2022/4/25 17:38
 * @Description: 两数之和(easy)
 */
public class TowNums {

    public static void main(String[] args) {
        int[] nums = {3,2,4};
        int target = 6;
        int[] ret = new TowNums().twoSum(nums, target);
        ArraysUtil.print(ret);
    }

    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j = i+1; j < nums.length; j++) {
                if(nums[i]+nums[j] == target){
                    return new int[]{i,j};
                }
            }
        }
        return new int[]{};
    }

    public int[] twoSum2(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            if(map.containsKey(target-nums[i])){
                return new int[]{map.get(target-nums[i]),i};
            }
            map.put(nums[i],i);
        }
        return new int[]{};
    }
}
